Constraint Functional Logic Programming for Origami Construction
نویسندگان
چکیده
We describe origami programming methodology based on constraint functional logic programming. The basic operations of origami are reduced to solving systems of equations which describe the geometric properties of paper folds. We developed two software components: one that provides primitives to construct, manipulate and visualize paper folds and the other that solves the systems of equations. Using these components, we illustrate computer-supported origami construction and show the significance of the constraint functional logic programming paradigm in the program development.
منابع مشابه
Computational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of origami geometry. An origami is constructed by a finite sequence of fold steps, each consisting in folding along a fold line or unfolding. We base the fold methods on a formal system called Huzita’s axiom system, and show how folding an origami can be formulated by a conditional rewrite system. A rewriting sequence of origami structures is...
متن کاملFunctional Logic Origami Programming with Open CFLP
Origami is a Japanese traditional art of paper folding. Recently, Origami became a topic of active research due to its relation to art, geometry, theorem proving, and declarative programming. It has been recognized that several interesting mathematical problems can be described in an elegant way by paper folds. In this paper we describe an origami programming methodology based on functional log...
متن کاملComputational Construction of a Maximum Equilateral Triangle Inscribed in an Origami
We present an origami construction of a maximum equilateral triangle inscribed in an origami, and an automated proof of the correctness of the construction. The construction and the correctness proof are achieved by a computational origami system called Eos (E-origami system). In the construction we apply the techniques of geometrical constraint solving, and in the automated proof we apply Gröb...
متن کاملProving and Constraint Solving in Computational Origami
Origami (paper folding) has a long tradition in Japan’s culture and education. We are developing a computational origami system, based on symbolic computation system Mathematica, for performing and reasoning about origami on the computer. This system is based on the implementation of the six fundamental origami folding steps (origami axioms) formulated by Huzita. In this paper, we show how our ...
متن کاملA Fully Sound Goal Solving Calculus for the Cooperation of Solvers in the CFLP Scheme
The CFLP scheme for Constraint Functional Logic Programming has instances CFLP (D) corresponding to different constraint domains D. In this paper, we propose an amalgamated sum construction for building coordination domains C, suitable to represent the cooperation among several constraint domains D1, . . . ,Dn via a mediatorial domain M. Moreover, we present a cooperative goal solving calculus ...
متن کامل